Multiple structure recovery with maximum coverage
نویسندگان
چکیده
منابع مشابه
Siting Multiple Observers for Maximum Coverage: An Accurate Approach
The selection of the minimal number of observers that ensures the maximum visual coverage over an area represented by a digital elevation model (DEM) have great interest in many fields, e.g., telecommunications, environment planning, among others. However, this problem is complex and intractable when the number of points of the DEM is relatively high. This complexity is due to three issues: 1) ...
متن کاملTwo-Dimensional Maximum p-Coverage Problem with Partial Coverage
In this paper, we introduce a new generalization of the classical maximum p-coverage problem (MCP) in which p geometric objects of known dimensions are to be located such that their union covers maximum weight distributed on a two-dimensional plane using another set of geometric objects such as circles, rectangles, polygons, etc. We allow partial coverage in the foregoing generalization and den...
متن کاملMaximum Coverage Representative Skyline
Skyline queries represent a dataset by the points on its pareto frontier, but can become very large. To alleviate this problem, representative skylines select exactly k skyline points. However, existing approaches are not scaleinvariant, not stable, or must materialise the entire skyline. We introduce the maximum coverage representative skyline, which returns the k points collectively dominatin...
متن کاملOnline Maximum k-Coverage
We study an online model for the maximum k-vertex-coverage problem, where given a graph G = (V,E) and an integer k, we ask for a subset A ⊆ V , such that |A| = k and the number of edges covered by A is maximized. In our model, at each step i, a new vertex vi is revealed, and we have to decide whether we will keep it or discard it. At any time of the process, only k vertices can be kept in memor...
متن کاملOnline Budgeted Maximum Coverage
We study the Online Budgeted Maximum Coverage (OBMC) problem. Subsets of a weighted ground set U arrive one by one, where each set has a cost. The online algorithm has to select a collection of sets, under the constraint that their cost is at most a given budget. Upon arrival of a set the algorithm must decide whether to accept or to reject the arriving set, and it may also drop previously acce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machine Vision and Applications
سال: 2017
ISSN: 0932-8092,1432-1769
DOI: 10.1007/s00138-017-0883-x